Reducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms
نویسندگان
چکیده
DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic and increases P2P system complexity, especially in a highly dynamic environment. In this paper, we discuss its effects on DHT routing performance and propose our solution to reduce this overhead.
منابع مشابه
Heterogeneity Aware P2P Algorithm by Using Mobile nodeID
The peer-to-peer systems have become an extremely popular platform for large-scale content sharing. A lot of research papers discussed the Distributed Hash Table (DHT) based p2p algorithms to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and for nodes which join/leave the system frequently, t...
متن کاملReducing Data Replication Overhead in DHT Based Peer-to-Peer System
DHT based p2p systems are appeared to provide scalable storage services with idle resource from many unreliable clients. If a DHT is used in storage intensive applications where data loss must be minimized, quick replication is especially important to replace lost redundancy on other nodes in reaction to failures. To achieve this easily, the simple replication method directly uses the consisten...
متن کاملReducing Replication Overhead for Data Durability in DHT Based P2P System
DHT based p2p systems appear to provide scalable storage services with idle resource from many unreliable clients. If a DHT is used in storage intensive applications where data loss must be minimized, quick replication is especially important to replace lost redundancy on other nodes in reaction to failures. To achieve this easily, a simple replication method directly uses a consistent set, suc...
متن کاملEstimating Churn in Structured P2P Overlay Networks
Structured peer-to-peer (P2P) networks have become an important alternative to the classic client-server architecture. Participating peers can join and leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). As a countermeasure most DHT protocols have to invest a signif...
متن کاملExploiting the Overhead in a DHT to Improve Lookup Latency
Third generation Peer-to-Peer (P2P) networks are characterized by the fact, that they are based on Distributed Hash Tables (DHT). Thus, it is intended to reduce the high signaling overhead observed in unstructured P2P networks like in Gnutella. However especially if the churn rate in the considered approach is high, i.e. nodes leaving and joining the network frequently (small session duration) ...
متن کامل